Exploiting Routing Redundancy via Structured Peer-to-Peer Overlays
نویسندگان
چکیده
Structured peer-to-peer overlays provide a natural infrastructure for resilient routing via efficient fault detection and precomputation of backup paths. These overlays can respond to faults in a few hundred milliseconds by rapidly shifting between alternate routes. In this paper, we present two adaptive mechanisms for structured overlays and illustrate their operation in the context of Tapestry, a fault-resilient overlay from Berkeley. We also describe a transparent, protocol-independent traffic redirection mechanism that tunnels legacy application traffic through overlays. Our measurements of a Tapestry prototype show it to be a highly responsive routing service, effective at circumventing a range of failures while incurring reasonable cost in maintenance bandwidth and additional routing latency.
منابع مشابه
Routing in Structured Peer - to - Peer Overlays
Anonymous Routing in Structured Peer-to-Peer Overlays
متن کاملOptimizing Routing in Structured Peer-to-Peer Overlay Networks Using Routing Table Redundancy
Structured peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry [3, 6, 5, 9] provide a self-organizing substrate for large-scale peer-to-peer applications. These systems provide efficient, fault-tolerant routing, object location and load balancing within a selforganization overlay network. In this paper, we show how redundant information that is collected as part of the norm...
متن کاملEnforcing Routing Consistency in Structured Peer-to-Peer Overlays: Should We and Could We?
In this paper, we argue that enforcing routing consistency in keybased routing (KBR) protocols can simplify P2P application design and make structured P2P overlays suitable for more applications. We define two levels of routing consistency semantics, namely weakly consistent KBR and strongly consistent KBR. We focus on an algorithm that provides strong consistency based on group membership serv...
متن کاملAdaptive dissemination of network state knowledge in structured peer-to-peer networks
One of the fundamental challenges in building Peer-to-Peer (P2P) applications is to locate resources across a dynamic set of nodes without centralised servers. Structured overlay networks solve this challenge by proving a key-based routing (KBR) layer that maps keys to nodes. The performance of KBR is strongly influenced by the dynamic and unpredictable conditions of P2P environments. To cope w...
متن کاملPartition Tolerance and Data Consistency in Structured Overlay Networks
Structured overlay networks form amajor class of peer-to-peer systems, which are used to build scalable, fault-tolerant and selfmanagingdistributed applications. This thesis presents algorithms for structured overlay networks, on the routing and data level, in the presence of network and node dynamism. On the routing level, we provide algorithms for maintaining the structure of the overlay, and...
متن کامل